Gray code orders for $$q$$ q -ary words avoiding a given factor

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Unequal Error Protection Capability of a q-ary Image of a Low-Rate q-ary Cyclic Code

An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate qm-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF(qm) into GF(q). A table of the UEP capability of binary images of low-rate Reed-S...

متن کامل

q-ary Compressive Sensing

We introduce q-ary compressive sensing, an extension of 1-bit compressive sensing. We propose a novel sensing mechanism and a corresponding recovery procedure. The recovery properties of the proposed approach are analyzed both theoretically and empirically. Results in 1-bit compressive sensing are recovered as a special case. Our theoretical results suggest a tradeoff between the quantization p...

متن کامل

fficient q-ary immuta

A fixed length code is called immutable if no codeword can be transformed into another codeword by using only a restricted set of symbol changes. Immutable codes are used to prevent undetectable updates of information stored over write-once memories 1141. In this paper we consider immutable codes on the alphabet Q = (0, . . . , q11. We prove that a maximum size immutable code of block length n ...

متن کامل

Polar codes for q-ary channels, q=2r

We study polarization for nonbinary channels with input alphabet of size q = 2 , r = 2, 3, . . . . Using Arıkan’s polarizing kernel H2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with capacity 1, 2, . . . , r bits, and that the total transmission rate approaches the symmetric capacity of the channel. This leads to an explicit transmis...

متن کامل

New inequalities for $$q$$ q -ary constant-weight codes

Using double counting, we prove Delsarte inequalities for qary codes and their improvements. Applying the same technique to q-ary constant-weight codes, we obtain new inequalities for q-ary constantweight codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Informatica

سال: 2015

ISSN: 0001-5903,1432-0525

DOI: 10.1007/s00236-015-0225-2